Clique problem - PDFSEARCH.IO - Document Search Engine

Clique problem
Results: 134

#	Item
41	CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:42:05 NP-complete problems Clique Travelling salesman problem Vertex cover NP-complete Cut Path decomposition Feedback vertex set Graph theory Theoretical computer science Mathematics
42	Chapter 1 Introduction Let f be Boolean function from nite binary strings to the set f0; 1g. The basic question of complexity theory is what computational resources are needed to compute f (x) for an arbitrary n-bit str Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2011-01-05 06:16:54 Circuit complexity Complexity classes Parity function ACC0 Switching lemma NC Clique problem Boolean circuit Circuit Theoretical computer science Computational complexity theory Applied mathematics
43	Parameterized Complexity News The Newsletter of the Parameterized Complexity Community fpt.wikidot.com May 2009 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 05:57:59 NP-complete problems Analysis of algorithms Graph coloring Parameterized complexity Complexity classes Kernelization Time complexity Clique problem Vertex cover Theoretical computer science Computational complexity theory Graph theory
44	Book Reviews The Golden Ticket: P, NP, and the Search for the Impossible Lance Fortnow Princeton University Press, 2013, 192 pp ISBN1 Add to Reading List Source URL: www.asiapacific-mathnews.com Language: English - Date: 2014-02-27 03:55:07 Complexity classes NP-complete problems Mathematical optimization NP-complete Computational problems P versus NP problem NP Decision problem Clique problem Theoretical computer science Computational complexity theory Applied mathematics
45	The Parameterized Complexity of Global Constraints∗ C. Bessiere LIRMM Montpellier, France Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2010-11-22 06:22:28 Computer programming Local consistency Constraint satisfaction Constraint logic programming Parameterized complexity Mathematical optimization Clique problem Decomposition method Complexity of constraint satisfaction Constraint programming Theoretical computer science Software engineering
46	CS 373 Final Exam Questions (May 7, 2001) Spring 2001 Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:52:30 Algorithm Palindrome Subsequence Clique problem Mathematics Theoretical computer science Clique
47	URL: http://www.elsevier.nl/locate/entcs/volume61.html 19 pages Parameterized Complexity: The Main Ideas and Connections to Practical Computing Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:10:30 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Dominating set Kernelization Vertex cover Clique problem NP-complete Theoretical computer science Computational complexity theory Applied mathematics
48	Journal of Artificial Intelligence Research–388 Submitted 10/11; publishedComputing All-Pairs Shortest Paths by Leveraging Low Treewidth Add to Reading List Source URL: jair.org Language: English - Date: 2012-03-19 16:09:33 Tree decomposition Interval graph Floyd–Warshall algorithm Neighbourhood Clique Split graph Shortest path problem Path decomposition Degeneracy Graph theory Graph operations Chordal graph
49	Public-Key Cryptography from Different Assumptions Benny Applebaum∗ Boaz Barak† Avi Wigderson‡ Add to Reading List Source URL: www.boazbarak.org Language: English - Date: 2011-10-10 23:51:30 Electronic commerce Computational hardness assumptions Hidden Field Equations Pseudorandom generator RSA XTR Learning with errors Clique problem One-way function Cryptography Finite fields Public-key cryptography
50	CS 373 Final Exam (December 15, 2000) Fall 2000 Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:48:10 Complexity classes NP-complete problems Mathematical optimization NP-hard Time complexity NP Independent set P versus NP problem Clique Theoretical computer science Computational complexity theory Applied mathematics